Generalizing the Pigeonhole Principle for Similarity Search in Hamming Space
نویسندگان
چکیده
منابع مشابه
the search for the self in becketts theatre: waiting for godot and endgame
this thesis is based upon the works of samuel beckett. one of the greatest writers of contemporary literature. here, i have tried to focus on one of the main themes in becketts works: the search for the real "me" or the real self, which is not only a problem to be solved for beckett man but also for each of us. i have tried to show becketts techniques in approaching this unattainable goal, base...
15 صفحه اولThe Pigeonhole Principle
Theorem 1.1. If n + 1 objects are put into n boxes, then at least one box contains two or more objects. Proof. Trivial. Example 1.1. Among 13 people there are two who have their birthdays in the same month. Example 1.2. There are n married couples. How many of the 2n people must be selected in order to guarantee that one has selected a married couple? Other principles related to the pigeonhole ...
متن کاملThe Topological Pigeonhole Principle for Ordinals
Given a cardinal κ and a sequence (αi )i∈κ of ordinals, we determine the least ordinal (when one exists) such that the topological partition relation
متن کاملStructured pigeonhole principle, search problems and hard tautologies
We consider exponentially large finite relational structures (with the universe {0, 1}) whose basic relations are computed by polynomial size (n) circuits. We study behaviour of such structures when pulled back by P/polymaps to a bigger or to a smaller universe. In particular, we prove that: 1. If there exists a P/poly map g : {0, 1} → {0, 1} , n < m, iterable for a proof system then a tautolog...
متن کاملOnline Nearest Neighbor Search in Hamming Space
We address the K Nearest Neighbors (KNN) problem in large binary datasets which is of major importance in several applied areas. The goal is to find the K nearest items in a dataset to a query point where both the query and the items lie in a Hamming space. We address this problem in its online setting, that is, data items are inserted sequentially into the dataset. We propose a data structure ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Knowledge and Data Engineering
سال: 2019
ISSN: 1041-4347,1558-2191,2326-3865
DOI: 10.1109/tkde.2019.2899597